Adaption of Pollard's kangaroo algorithm to the FACTOR problem
نویسنده
چکیده
In [BKT11] Baba, Kotyada and Teja introduced the FACTOR problem over non-abelian groups as base of an ElGamal-like cryptosystem. They conjectured that there is no better method than the naive one to solve the FACTOR problem in a general group. Shortly afterwards Stanek published an extension of the baby-step giant-step algorithm disproving this conjecture [Sta11]. Since baby-step giant-step methods are limited in practice because of memory requirements we present a modification of Pollard’s kangaroo algorithm that solves the FACTOR problem requiring only negligible memory.
منابع مشابه
Kangaroo Methods for Solving the Interval Discrete Logarithm Problem
The interval discrete logarithm problem is defined as follows: Given some g, h in a group G, and some N ∈ N such that gz = h for some z where 0 ≤ z < N , find z. At the moment, kangaroo methods are the best low memory algorithm to solve the interval discrete logarithm problem. The fastest non parallelised kangaroo methods to solve this problem are the three kangaroo method, and the four kangaro...
متن کاملUsing Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval
The Pollard kangaroo method solves the discrete logarithm problem (DLP) in an interval of size N with heuristic average case expected running time approximately 2 √ N group operations. A recent variant of the kangaroo method, requiring one or two inversions in the group, solves the problem in approximately 1.71 √ N group operations. It is well-known that the Pollard rho method can be sped-up by...
متن کاملComputing discrete logarithms in an interval
The discrete logarithm problem in an interval of size N in a group G is: Given g, h ∈ G and an integer N to find an integer 0 ≤ n ≤ N , if it exists, such that h = gn. Previously the best low-storage algorithm to solve this problem was the van Oorschot and Wiener version of the Pollard kangaroo method. The heuristic average case running time of this method is (2 + o(1)) √ N group operations. We...
متن کاملThe parallelized Pollard kangaroo method in real quadratic function fields
We show how to use the parallelized kangaroo method for computing invariants in real quadratic function fields. Specifically, we show how to apply the kangaroo method to the infrastructure in these fields. We also show how to speed up the computation by using heuristics on the distribution of the divisor class number, and by using the relatively inexpensive baby steps in the real quadratic mode...
متن کاملComputing elliptic curve discrete logarithms with improved baby-step giant-step algorithm
The negation map can be used to speed up the computation of elliptic curve discrete logarithms using either the baby-step giant-step algorithm (BSGS) or Pollard rho. Montgomery’s simultaneous modular inversion can also be used to speed up Pollard rho when running many walks in parallel. We generalize these ideas and exploit the fact that for any two elliptic curve points X and Y , we can effici...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2011 شماره
صفحات -
تاریخ انتشار 2011